Half-arc-transitive graphs and chiral hypermaps

نویسندگان

  • Antonio Breda d'Azevedo
  • Roman Nedela
چکیده

A subgroup G of automorphisms of a graph X is said to be 2 -arc-transitive if it is vertexand edgebut not arc-transitive. The graph X is said to be 2 -arc-transitive if Aut X is 1 2 -arc-transitive. The interplay of two different concepts, maps and hypermaps on one side and 2 -arc-transitive group actions on graphs on the other, is investigated. The correspondence between regular maps and 2 -arctransitive group actions on graphs of valency 4 given via the well known concept of medial graphs (European J. Combin. 19 (1998) 345) is generalised. Any orientably regular hypermap H gives rise to a uniquely determined medial map whose underlying graph Y admits a 2 -arc-transitive group action of the automorphism group G of the original hypermap H. Moreover, the vertex stabiliser of the action of G on Y is cyclic. On the other hand, given graph X and G ≤ Aut X acting 2 -arc-transitively with a cyclic vertex stabiliser, we can construct an orientably regular hypermap H with G being the orientation preserving automorphism group. In particularly, if the graph X is 2 -arc-transitive, the corresponding hypermap is necessarily chiral, that is, not isomorphic to its mirror image. Note that the associated 2 -arc-transitive group action on the medial graph induced by a map always has a stabiliser of order two, while when it is induced by a (pure) hypermap the stabiliser can be cyclic of arbitrarily large order. Hence moving from maps to hypermaps increases our chance of getting different types of 2 -arc-transitive group action. Indeed, in last section we have applied general results to construct 2 -arc-transitive graphs with cycle stabilisers of arbitrarily large orders. © 2003 Elsevier Ltd. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On quartic half-arc-transitive metacirculants

Following Alspach and Parsons, a metacirculant graph is a graph admitting a transitive group generated by two automorphisms ρ and σ , where ρ is (m,n)semiregular for some integers m ≥ 1, n ≥ 2, and where σ normalizes ρ, cyclically permuting the orbits of ρ in such a way that σ has at least one fixed vertex. A halfarc-transitive graph is a vertexand edgebut not arc-transitive graph. In this arti...

متن کامل

Half-arc-transitive graphs of order 4p of valency twice a prime

A graph is half-arc-transitive if its automorphism group acts transitively on vertices and edges, but not on arcs. Let p be a prime. Cheng and Oxley [On weakly symmetric graphs of order twice a prime, J. Combin. Theory B 42(1987) 196-211] proved that there is no half-arc-transitive graph of order 2p, and Alspach and Xu [ 12 -transitive graphs of order 3p, J. Algebraic Combin. 3(1994) 347-355] c...

متن کامل

Constructing even radius tightly attached half-arc-transitive graphs of valency four

A finite graph X is half-arc-transitive if its automorphism group is transitive on vertices and edges, but not on arcs. When X is tetravalent, the automorphism group induces an orientation on the edges and a cycle of X is called an alternating cycle if its consecutive edges in the cycle have opposite orientations. All alternating cycles of X have the same length and half of this length is calle...

متن کامل

Finite vertex-primitive and vertex-biprimitive 2-path-transitive graphs

This paper presents a classification of vertex-primitive and vertex-biprimitive 2-path-transitive graphs which are not 2-arc-transitive. The classification leads to constructions of new examples of half-arc-transitive graphs.

متن کامل

Tetravalent half-arc-transitive graphs of order p4

A graph is half-arc-transitive if its automorphism group acts transitively on its vertex set, edge set, but not arc set. Let p and q be primes. It is known that no tetravalent half-arc-transitive graphs of order 2p2 exist and a tetravalent half-arctransitive graph of order 4p must be non-Cayley; such a non-Cayley graph exists if and only if p − 1 is divisible by 8 and it is unique for a given o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Eur. J. Comb.

دوره 25  شماره 

صفحات  -

تاریخ انتشار 2004